Modified moving least squares with polynomial bases for scattered data approximation

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modified moving least squares with polynomial bases for scattered data approximation

One common problem encountered in many fields is the generation of surfaces based on values at irregularly distributed nodes. To tackle such problems, we present a modified, robust moving least squares (MLS) method for scattered data smoothing and approximation. The error functional used in the derivation of the classical MLS approximation is augmented with additional terms based on the coeffic...

متن کامل

Least-squares polynomial approximation

We construct symmetric polar WAMs (Weakly Admissible Meshes) with low cardinality for least-squares polynomial approximation on the disk. These are then mapped to an arbitrary triangle. Numerical tests show that the growth of the least-squares projection uniform norm is much slower than the theoretical bound, and even slower than that of the Lebesgue constant of the best known interpolation poi...

متن کامل

Moving Least Squares Approximation

An alternative to radial basis function interpolation and approximation is the so-called moving least squares method. As we will see below, in this method the approximation Pf to f is obtained by solving many (small) linear systems, instead of via solution of a single – but large – linear system as we did in the previous chapters. To make a connection with the previous chapters we start with th...

متن کامل

Scattered Data Approximation of Noisy Data via Iterated Moving Least Squares

In this paper we focus on two methods for multivariate approximation problems with non-uniformly distributed noisy data. The new approach proposed here is an iterated approximate moving least-squares method. We compare our method to ridge regression which filters out noise by using a smoothing parameter. Our goal is to find an optimal number of iterations for the iterative method and an optimal...

متن کامل

Fast least-squares polynomial approximation in moving time windows

Only a few time series methods are applicable to signal trend analysis under real-time conditions. The use of orthogonal polynomials for least-squares approximations on discrete data turned out to be very e cient for providing estimators in the time domain. A polynomial extrapolation considering signal trends in a certain time window is obtainable even for high sampling rates. The presented met...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Applied Mathematics and Computation

سال: 2015

ISSN: 0096-3003

DOI: 10.1016/j.amc.2015.05.150